The solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both SAPs combined produce a highly implementable versatile SAP. The proposed SAP has p*p processing elements (PEs) solving the APP of an N-vertex graph in N/sup 3//p/sup 2/+N/sup 2//p+3p-2 cycles. With slight modifications in the operations performed by the PEs, the problem is optimally solved in N/sup 3//p/sup 2/+3p-2 cycles.
展开▼
机译：解决了固定大小的脉动阵列处理器（SAP）解决任意大小图形的代数路径问题（APP）的问题。 APP被分解为两个子问题，而SAP是为每个子问题设计的。这两个SAP共同产生了高度可实施的通用SAP。所提出的SAP具有p * p处理元素（PE），可解决N / sup 3 // p / sup 2 / + N / sup 2 // p + 3p-2周期的N顶点图的APP。通过对PE进行的操作稍加修改，可以在N / sup 3 // p / sup 2 / + 3p-2个周期中最佳解决此问题。
展开▼
